Computation of detour index of TUHC6[2p, q] nanotubes for any p and q.
نویسندگان
چکیده
The detour d(i, j) between vertices i and j of a graph is the number of edges of the longest path connecting these vertices. The matrix whose (i, j)-entry is the detour between vertices i and j is called the detour matrix. The half sum D of detours between all pairs of vertices (in a connected graph) is the detour index, i.e., D = (1/2) Sigma(j) Sigma(i) d(i, j). In this paper, we computed the detour index of TUHC6[2p, q] nanotubes for any p and q.
منابع مشابه
Topological relationship between electric quadrupole, hexadecapole moments, energy and Padmakar–Ivan index in armchair polyhex nanotubes TUVC6[2p,q]
The electric quadrupole, hexadecapole moments, energy (kJmol -1) for some armchair polyhex carbon nanotubes TUVC6[2p,q] are performed by Beck-Lee-Yang-Parr [B3LYP] on 3-21G basis set using the standard procedure indices GAUSSIAN 98, then the Padmakar-Ivan (PI) index of TUVC6[2p,q] nanotubes in the terms of their circumference (2p) and lengh (q) is calculated and the relationships between the Pa...
متن کاملCOMPUTING WIENER INDEX OF HAC5C7[p, q] NANOTUBES BY GAP PROGRAM
The Wiener index of a graph Gis defined as W(G) =1/2[Sum(d(i,j)] over all pair of elements of V(G), where V (G) is the set of vertices of G and d(i, j) is the distance between vertices i and j. In this paper, we give an algorithm by GAP program that can be compute the Wiener index for any graph also we compute the Wiener index of HAC5C7[p, q] and HAC5C6C7[p, q] nanotubes by this program.
متن کاملPERMUTATION GROUPS WITH BOUNDED MOVEMENT ATTAINING THE BOUNDS FOR ODD PRIMES
Let G be a transitive permutation group on a set ? and let m be a positive integer. If no element of G moves any subset of ? by more than m points, then |? | [2mp I (p-1)] wherep is the least odd primedividing |G |. When the bound is attained, we show that | ? | = 2 p q ….. q where ? is a non-negative integer with 2 < p, r 1 and q is a prime satisfying p < q < 2p, ? = 0 or 1, I i n....
متن کاملThe Degree Distance of Armchair Polyhex Nanotubes
The degree distance of a graph which is a degree analogue of the Wiener index of the graph. Let G = TUV C6[2p, q] be the carbon nanotubes covered by C6, formulas for calculating the degree distance of armchair polyhex nanotubes TUV C6[2p, q] are provided. Mathematics Subject Classification: 05C05, 05C12
متن کاملComputation of the q-th roots of circulant matrices
In this paper, we investigate the reduced form of circulant matrices and we show that the problem of computing the q-th roots of a nonsingular circulant matrix A can be reduced to that of computing the q-th roots of two half size matrices B - C and B + C.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of nanoscience and nanotechnology
دوره 11 10 شماره
صفحات -
تاریخ انتشار 2011